A Note on the Acquaintance Time of Random Graphs
نویسندگان
چکیده
منابع مشابه
A Note on the Acquaintance Time of Random Graphs
In this short note, we prove a conjecture of Benjamini, Shinkar, and Tsur on the acquaintance time AC(G) of a random graph G ∈ G(n, p). It is shown that asymptotically almost surely AC(G) = O(log n/p) for G ∈ G(n, p), provided that pn−log n−log log n→∞ (that is, above the threshold for Hamiltonicity). Moreover, we show a matching lower bound for dense random graphs, which also implies that asym...
متن کاملThe acquaintance time of (percolated) random geometric graphs
In this paper, we study the acquaintance time AC(G) defined for a connected graph G. We focus on G(n, r, p), a random subgraph of a random geometric graph in which n vertices are chosen uniformly at random and independently from [0, 1], and two vertices are adjacent with probability p if the Euclidean distance between them is at most r. We present asymptotic results for the acquaintance time of...
متن کاملA Tight Upper Bound on Acquaintance Time of Graphs
In this note we confirm a conjecture raised by Benjamini et al. [BST13] on the acquaintance time of graphs, proving that for all graphs G with n vertices it holds that AC(G) = O(n3/2), which is tight up to a multiplicative constant. This is done by proving that for all graphs G with n vertices and maximal degree ∆ it holds that AC(G) ≤ 20∆n. Combining this with the bound AC(G) ≤ O(n2/∆) from [B...
متن کاملA note on coloring sparse random graphs
Coja-Oghlan and Taraz (2004) presented a graph coloring algorithm that has expected linear running time for random graphs with edge probability p satisfying np ≤ 1.01. In this work, we develop their analysis by exploiting generating function techniques. We show that, in fact, their algorithm colors Gn,p with the minimal number of colors and has expected linear running time, provided that np ≤ 1...
متن کاملA note on vague graphs
In this paper, we introduce the notions of product vague graph, balanced product vague graph, irregularity and total irregularity of any irregular vague graphs and some results are presented. Also, density and balanced irregular vague graphs are discussed and some of their properties are established. Finally we give an application of vague digraphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2013
ISSN: 1077-8926
DOI: 10.37236/3357